Every Irreducible Element is Prime in a Unique Factorisation Domain

Theorem

If R is a unique factorisation domain and aR is irreducible, then a is prime.

Proof

Let a be an irreducible element in a unique factorisation domain R. Then consider some s,tR for which

ast.

Then, there exists some k such that

ak=st.

Since we have uniqueness of factorisation, we can factorise each side into irreducibles in a unique way (up to reordering and associates), that is

ak1kl=s1snt1tm.

The fact that a is left on its own is a consequence of the irreducibility of a (it is already fully factored).

This means that each term in the left hand side of our factorisation is an associate with an element on the right hand side, and we can pair the elements as such.

Therefore

a=uisiora=ujtj

for some unit ui or uj and some positive integer in or jm.

Hence asi and as with the multiple being the product of all factors of s except si, or atj and therefore similarly at.

This proves that a is prime.


Corollary

The set of prime elements is equal to the set of irreducible elements in a unique factorisation domain.

This follows simply from the above, and the fact that every unique factorisation domain is an integral domain with every prime being irreducible in an integral domain.